Another example of a finitely presented infinite simple group
نویسندگان
چکیده
منابع مشابه
A Finitely Presented Torsion-free Simple Group
We construct a finitely presented torsion-free simple group Σ0, acting cocompactly on a product of two regular trees. An infinite family of such groups has been introduced by Burger-Mozes ([2, 4]). We refine their methods and get Σ0 as an index 4 subgroup of a group Σ < Aut(T12)×Aut(T8) presented by 10 generators and 24 short relations. For comparison, the smallest virtually simple group of [4,...
متن کاملFinitely Presented Infinite Graphs
This thesis contributes to the study of families of finitely presented infinite graphs,their structural properties and their relations to each other. Given a finite alpha-bet Σ, a Σ-labeled infinite graph can be characterized as a finite set of binaryrelations (Ra)a∈Σ over an arbitrary countable domain V . There are many ways tofinitely characterize such sets of relations, eithe...
متن کاملWeakly Finitely Presented Infinite Periodic Groups
A group G given by a presentation G = 〈A ‖ R〉 is called weakly finitely presented if every finitely generated subgroup of G, generated by (images of) some words in A, is naturally isomorphic to the subgroup of a group G0 = 〈A0 ‖ R0〉, where A0 ⊆ A, R0 ⊆ R are finite, generated by (images of) the same words. In the article, weakly finitely presented periodic groups which are not locally finite ar...
متن کاملA Countable Family of Finitely Presented Infinite Congruence-free Monoids
We prove that monoids Mon〈a, b, c, d : ab = 0, ac = 1, db = 1, dc = 1 dab = 1, dab = 1, . . . , dab = 1〉 are congruence-free for all n ≥ 1. This provides a new countable family of finitely presented congruence-free monoids, bringing one step closer to understanding the Boone–Higman Conjecture. We also provide examples which show that finitely presented congruence-free monoids may have quadratic...
متن کاملA Cohomological Criterion for a Finitely Presented Group to Be Infinite
The problem of proving that a given finitely presented group G is infinite can be very difficult (or impossible) in general, but there are several possible approaches that can be tried, some of which can be rendered much more effective with the assistance of computers. To this list, we add another one, which can be applied if an epimorphism of G onto a finite group H is known. The idea depends ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1981
ISSN: 0021-8693
DOI: 10.1016/0021-8693(81)90202-7